Detrending moving average algorithm for multifractals
نویسندگان
چکیده
منابع مشابه
Detrending moving average algorithm for multifractals.
The detrending moving average (DMA) algorithm is a widely used technique to quantify the long-term correlations of nonstationary time series and the long-range correlations of fractal surfaces, which contains a parameter θ determining the position of the detrending window. We develop multifractal detrending moving average (MFDMA) algorithms for the analysis of one-dimensional multifractal measu...
متن کاملA Lattice Algorithm for Pricing Moving Average Barrier Options
This paper presents a lattice algorithm for pricing both Europeanand American-style moving average barrier options (MABOs). We develop a finite-dimensional partial differential equation (PDE) model for discretely monitored MABOs and solve it numerically by using a forward shooting grid method. The modeling PDE for continuously monitored MABOs has infinite dimensions and cannot be solved directl...
متن کاملMoving Average Processes with Infinite Variance
The sample autocorrelation function (acf) of a stationary process has played a central statistical role in traditional time series analysis, where the assumption is made that the marginal distribution has a second moment. Now, the classical methods based on acf are not applicable in heavy tailed modeling. Using the codifference function as dependence measure for such processes be shown it be as...
متن کاملRobust Audio Watermarking Algorithm Based on Moving Average and DCT
Noise is often brought to host audio by common signal processing operation, and it usually changes the high-frequency component of an audio signal. So embedding watermark by adjusting low-frequency coefficient can improve the robustness of a watermark scheme. Moving Average sequence is a low-frequency feature of an audio signal. This work proposed a method which embedding watermark into the max...
متن کاملA New Algorithm for High Average-utility Itemset Mining
High utility itemset mining (HUIM) is a new emerging field in data mining which has gained growing interest due to its various applications. The goal of this problem is to discover all itemsets whose utility exceeds minimum threshold. The basic HUIM problem does not consider length of itemsets in its utility measurement and utility values tend to become higher for itemsets containing more items...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2010
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.82.011136